Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees

In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based sc...

متن کامل

Implementing Decisions in Binary Decision Trees Using Independent Component Analysis

There are various ways to implement decisions in binary decision trees. Most approaches can be interpreted as greedy methods optimizing some local goodness criteria at each node. Often it is required that either target values (regression trees) or class labels (classi-cation trees) are available. In this paper linear ICA is applied to implement the decisions in a binary tree. The rationale is t...

متن کامل

Connected Component Labeling Using Modified Linear Quadtrees

Using the modified linear quadtree proposed in [1,9], this paper presents an O(n·N) algorithm for labeling connected components of a region consisting of N BLACK nodes in a 2n by 2n binary image. As a direct application of the algorithm, a method for computing the perimeter of a region is also described.

متن کامل

Fast connected-component labeling

Article history: Received 27 March 2008 Received in revised form 2 September 2008 Accepted 20 October 2008

متن کامل

Linear Variation and Optimized Algorithm of Connected-Component Labeling in Binary Image

Linear variation is a topological characteristic of a function of two variables. The problem of linear variation computing can be reduced to the problem of counting connected components in a binary image with eight-connected connectivity. The proposed method is essentially a modification of some known raster algorithms for connected components labeling that groups pixels into 2× 2 cells. A perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sensors

سال: 2015

ISSN: 1424-8220

DOI: 10.3390/s150923763